• Conference Object  

      Content classification for caching under CDNs 

      Pallis, George C.; Thomos, Charilaos; Stamos, Kostas; Vakali, Athena I.; Andreadis, Georgios (2008)
      Content Delivery Networks (CDNs) provide an efficient support for serving "resource-hungry" applications while minimizing the network impact of content delivery as well as shifting the traffic away from overloaded origin ...
    • Conference Object  

      A convex programming approach to the multiobjective H2/H∞ problem 

      Djouadi, S. M.; Charalambous, Charalambos D.; Repperger, D. W. (2002)
      In this paper, Banach space duality theory for the multiobjective H2/H∞ problem developed recently by the authors, is used to develop algorithms to solve this problem by approximately reducing the dual and predual ...
    • Conference Object  

      Deriving quantitative structure-activity relationship models using genetic programming for drug discovery 

      Neophytou, K.; Nicolaou, Christos A.; Pattichis, Constantinos S.; Schizas, Christos N. (2008)
      Genetic Programming is a heuristic search algorithm inspired by evolutionary techniques that has been shown to produce satisfactory solutions to problems related to several scientific domains [1]. Presented here is a ...
    • Conference Object  

      Integer programs and valid inequalities for planning problems 

      Bockmayr, A.; Dimopoulos, Yannis (Springer Verlag, 2000)
      Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinato-rial search problem. The underlying representation language is basically propositional logic. While ...
    • Article  

      Max-product algorithms for the generalized multiple-fault diagnosis problem 

      Le, T.; Hadjicostis, Christoforos N. (2007)
      In this paper, we study the application of the max-product algorithm (MPA) to the generalized multiple-fault diagnosis (GMFD) problem, which consists of components (to be diagnosed) and alarms/connections that can be ...
    • Article  

      Towards local search for answer sets 

      Dimopoulos, Yannis; Sideris, A. (2002)
      Answer set programming has emerged as a new important paradigm for declarative problem solving. It relies on algorithms that compute the stable models of a logic program, a problem that is, in the worst-case, intractable. ...